Mean perimeter and mean area of the convex hull over planar random walks
نویسندگان
چکیده
We investigate the geometric properties of the convex hull over n successive positions of a planar random walk, with a symmetric continuous jump distribution. We derive the large n asymptotic behavior of the mean perimeter. In addition, we compute the mean area for the particular case of isotropic Gaussian jumps. While the leading terms of these asymptotics are universal, the subleading (correction) terms depend on finer details of the jump distribution and describe a “finite size effect” of discrete-time jump processes, allowing one to accurately compute the mean perimeter and the mean area even for small n, as verified by Monte Carlo simulations. This is particularly valuable for applications dealing with discrete-time jumps processes and ranging from the statistical analysis of single-particle tracking experiments in microbiology to home range estimations in ecology. PACS numbers: 02.50.-r, 05.40.-a, 02.70.Rr, 05.10.Gg
منابع مشابه
Convex Hulls of Multidimensional Random Walks
Let Sk be a random walk in R such that its distribution of increments does not assign mass to hyperplanes. We study the probability pn that the convex hull conv(S1, . . . , Sn) of the first n steps of the walk does not include the origin. By providing an explicit formula, we show that for planar symmetrically distributed random walks, pn does not depend on the distribution of increments. This e...
متن کاملConvex hulls of random walks: Large-deviation properties.
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean perimeter 〈L〉 and the mean area 〈A〉 have been studied before, analytically and numerically, and exact results are known for large T (Brownian motion limit), li...
متن کاملRemoving Outliers to Minimize Area and Perimeter
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O ( n (( 4c 2c ) (3c) + log n )) time algorithm that solves this problem when “smallest” is taken to mean least area or least perimeter.
متن کاملRandom Walks That Avoid Their past Convex Hull
We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction are on the order of n. This behavior is also observed for the extremal investor, a natural financial model related to the planar walk. Figure 1: 300 steps of the rancher
متن کاملOn the 𝒪β of a planar point set
We study the Oβ-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle β. Given a set P of n points in the plane, we show how to maintain the Oβ-hull of P while β runs from 0 to π in Θ(n log n) time and O(n) space. With the same complexity, we also find the values of β that maximize the area and the perimeter of the Oβ-hull and, furthe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017